Derandomizing the HSSW Algorithm for 3-SATMAKINO, Kazuhisa; TAMAKI, Suguru; YAMAMOTO, Masaki et al.Algorithmica. 2013, Vol 67, Num 2, pp 112-124, issn 0178-4617, 13 p.Conference Paper

A zero-one law for RP and derandomization of AM if NP is not smallIMPAGLIAZZO, Russell; MOSER, Philippe.Information and computation (Print). 2009, Vol 207, Num 7, pp 787-792, issn 0890-5401, 6 p.Article

Derandomization of PPSZ for unique-k-SATROLF, Daniel.Lecture notes in computer science. 2005, pp 216-225, issn 0302-9743, isbn 3-540-26276-8, 10 p.Conference Paper

A simpler and better derandomization of an approximation algorithm for single source rent-or-buyWILLIAMSON, David P; VAN ZUYLEN, Anke.Operations research letters. 2007, Vol 35, Num 6, pp 707-712, issn 0167-6377, 6 p.Article

A zero-one SUBEXP-dimension law for BPPMOSER, Philippe.Information processing letters. 2011, Vol 111, Num 9, pp 429-432, issn 0020-0190, 4 p.Article

Derandomizing homomorhism testing in general groupsSHPILKA, Amir; WIGDERSON, Avi.SIAM journal on computing (Print). 2007, Vol 36, Num 4, pp 1215-1230, issn 0097-5397, 16 p.Article

Efficient steganography with provable security guaranteesKIAYIAS, Aggelos; RAEKOW, Yona; RUSSELL, Alexander et al.Lecture notes in computer science. 2005, pp 118-130, issn 0302-9743, isbn 3-540-29039-7, 1Vol, 13 p.Conference Paper

Relations between average-case and worst-case complexityPAVAN, A; VINODCHANDRAN, N. V.Lecture notes in computer science. 2005, pp 422-432, issn 0302-9743, isbn 3-540-28193-2, 11 p.Conference Paper

Solvable group isomorphism is (almost) in NP ∩ coNPARVIND, V; TORAN, Jacobo.IEEE Conference on Computational Complexity. 2004, pp 91-103, isbn 0-7695-2120-7, 1Vol, 13 p.Conference Paper

EXPLICIT CONSTRUCTION OF A SMALL ∈-NET FOR LINEAR THRESHOLD FUNCTIONSRABANI, Yuval; SHPILKA, Amir.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3501-3520, issn 0097-5397, 20 p.Article

Generating randomized roundings with cardinality constraints and derandomizationsDOERR, Benjamin.Lecture notes in computer science. 2006, pp 571-583, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 13 p.Conference Paper

KAKEYA SETS, NEW MERGERS, AND OLD EXTRACTORS : Foundation of Computer ScienceDVIR, Zeev; WIGDERSON, Avi.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 778-792, issn 0097-5397, 15 p.Article

Deterministic Sampling Algorithms for Network DesignVAN ZUYLEN, Anke.Algorithmica. 2011, Vol 60, Num 1, pp 110-151, issn 0178-4617, 42 p.Conference Paper

Geometric Representation of Graphs in Low Dimension Using Axis Parallel BoxesSUNIL CHANDRAN, L; FRANCIS, Mathew C; SIVADASAN, Naveen et al.Algorithmica. 2010, Vol 56, Num 2, pp 129-140, issn 0178-4617, 12 p.Article

LOW-END UNIFORM HARDNESS VERSUS RANDOMNESS TRADEOFFS FOR AM : Theory of ComputingSHALTIEL, Ronen; UMANS, Christopher.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1006-1037, issn 0097-5397, 32 p.Article

Undirected Connectivity in Log-SpaceREINGOLD, Omer.Journal of the Association for Computing Machinery. 2008, Vol 55, Num 4, issn 0004-5411, 17.1-17.24Article

Non-independent randomized rounding and coloringDOERR, Benjamin.Discrete applied mathematics. 2006, Vol 154, Num 4, pp 650-659, issn 0166-218X, 10 p.Conference Paper

Deterministic Discrepancy MinimizationBANSAL, Nikhil; SPENCER, Joel.Algorithmica. 2013, Vol 67, Num 4, pp 451-471, issn 0178-4617, 21 p.Conference Paper

Proppian random walks in ZFREIRE, Juliana; SPENCER, Joel.Discrete mathematics. 2011, Vol 311, Num 5, pp 349-361, issn 0012-365X, 13 p.Article

Deterministically testing sparse polynomial identities of unbounded degreeBLASER, Markus; HARDT, Moritz; LIPTON, Richard J et al.Information processing letters. 2009, Vol 109, Num 3, pp 187-192, issn 0020-0190, 6 p.Article

A linear time deterministic algorithm to find a small subset that approximates the centroidWORAH, Pratik; SEN, Sandeep.Information processing letters. 2007, Vol 105, Num 1, pp 17-19, issn 0020-0190, 3 p.Article

Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gatesVIOLA, Emanuele.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1387-1403, issn 0097-5397, 17 p.Article

Deterministic hypergraph coloring and its applicationsLU, Chi-Jen.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 2, pp 320-331, issn 0895-4801, 12 p.Article

Deterministic constructions of approximate distance oracles and spannersRODITTY, Liam; THORUP, Mikkel; ZWICK, Uri et al.Lecture notes in computer science. 2005, pp 261-272, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

Derandomization of dimensionality reduction and SDP based algorithmsBHARGAVA, Ankur; KOSARAJU, S. Rao.Lecture notes in computer science. 2005, pp 396-408, issn 0302-9743, isbn 3-540-28101-0, 13 p.Conference Paper